Pii: S0024-3795(02)00455-x
نویسندگان
چکیده
We discuss matrix pencils with a double symmetry structure that arise in the Hartree– Fock model in quantum chemistry. We derive anti-triangular condensed forms from which the eigenvalues can be read off. Ideally these would be condensed forms under unitary equivalence transformations that can be turned into stable (structure preserving) numerical methods. For the pencils under consideration this is a difficult task and not always possible. We present necessary and sufficient conditions when this is possible. If this is not possible then we show how we can include other transformations that allow to reduce the pencil to an almost antitriangular form. © 2002 Elsevier Science Inc. All rights reserved. AMS classification: 65F15; 15A21; 15A22; 15A57
منابع مشابه
Pii: S0024-3795(02)00258-6
We present and analyze a probabilistic model for asynchronous iteration of linear systems. The model is similar in spirit to the chaotic model proposed by Chazan and Miranker in 1969, but with the choice of components and delays being based on probability distributions. We give sufficient conditions and necessary conditions for the expected value of the error to converge to zero. In addition we...
متن کاملDetecting a definite Hermitian pair and a hyperbolic or elliptic quadratic eigenvalue problem, and associated nearness problems
An important class of generalized eigenvalue problems Ax = λBx is those in which A and B are Hermitian and some real linear combination of them is definite. For the quadratic eigenvalue problem (QEP) (λ2A+ λB + C)x = 0 with Hermitian A, B and C and positive definite A, particular interest focuses on problems in which (x∗Bx)2 − 4(x∗Ax)(x∗Cx) is one-signed for all non-zero x—for the positive sign...
متن کاملSharp upper bounds for the Laplacian graph eigenvalues
Let G = (V ,E) be a simple connected graph and λ1(G) be the largest Laplacian eigenvalue of G. In this paper, we prove that: 1. λ1(G) = max{du +mu : u ∈ V } if and only if G is a regular bipartite or a semiregular bipartite graph, where du and mu denote the degree of u and the average of the degrees of the vertices adjacent to u, respectively. 2. λ1(G) = 2 + √ (r − 2)(s − 2) if and only if G is...
متن کاملEfficient matrix preconditioners for black box linear algebra
The main idea of the “black box” approach in exact linear algebra is to reduce matrix problems to the computation of minimum polynomials. In most cases preconditioning is necessary to obtain the desired result. Here good preconditioners will be used to ensure geometrical/algebraic properties on matrices, rather than numerical ones, so we do not address a condition number. We offer a review of p...
متن کاملAn inequality for polymatroid functions and its applications
An integral-valued set function f : 2 7→ Z is called polymatroid if it is submodular, non-decreasing, and f(∅) = 0. Given a polymatroid function f and an integer threshold t ≥ 1, let α = α(f, t) denote the number of maximal sets X ⊆ V satisfying f(X) < t, let β = β(f, t) be the number of minimal sets X ⊆ V for which f(X) ≥ t, and let n = |V |. We show that if β ≥ 2 then α ≤ β , where c = c(n, β...
متن کامل